Turing Unbound: Transfinite Computation
نویسنده
چکیده
Till thine Infinity shall be A robe of envenomed agony; And thine Omnipotence a crown of pain, To cling like burning gold round thy dissolving brain. 1 Introduction 2 To the ω'th station! 3 Scope of some other models: the extent of computation in Malament-Hogarth spacetimes. Case Studies: a) Etesi-Németi models in Kerr spacetimes; b) Hogarth's models more abstractly considered.
منابع مشابه
Infinite Time Cellular Automata: a Real Computation Model
We define a new transfinite time model of computation, infinite time cellular automata. The model is shown to be as powerful than infinite time Turing machines, both on finite and infinite inputs; thus inheriting many of its properties. We then show how to simulate the canonical real computation model, BSS machines, with infinite time cellular automata in exactly ω steps.
متن کاملSupertask computation
Infinite time Turing machines extend the classical Turing machine concept to transfinite ordinal time, thereby providing a natural model of infinitary computability that sheds light on the power and limitations of supertask algorithms.
متن کاملDiscrete Transfinite Computation
We describe various computational models based initially, but not exclusively, on that of the Turing machine, that are generalized to allow for transfinitely many computational steps. Variants of such machines are considered that have longer tapes than the standard model, or that work on ordinals rather than numbers. We outline the connections between such models and the older theories of recur...
متن کاملCharacteristics of discrete transfinite time Turing machine models: Halting times, stabilization times, and Normal Form theorems
We give an account of the basic determinants of the courses of computation of an Infinite Time Turing machine (ITTM), a model of computation which allows for transfinitely many steps of computation. One such basic theorem relates the ordinal codes capable of being output on halting computations to those capable of being produced eventually by some non-terminating computation. This socaled “λ-ζ-...
متن کاملOn the Physical Possibility of Ordinal Computation
α-recursion lifts classical recursion theory from the first transfinite ordinal ω to an arbitrary admissible ordinal α [13]. Turing machine models for α-recursion and other types of transfinite computation have been proposed and studied [5] and [7] and are applicable in computational approaches to the foundations of logic and mathematics [11]. They also provide a natural setting for modeling ex...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007